Performance Comparison of Main Memory Database Recovery Algorithms

نویسندگان

  • Yutong Wang
  • Vijay Kumar
چکیده

We present a detail performance study of three main memory recovery algorithms: Levy and Silberschatz's Log-Driven Backups, Jagadish, Silberschatz and Sudarshan's Recovery from Main Memory Lapses, and Kumar's Partial Recovery through simulation modeling. Our results show that load balancing signiicantly aaects the performance, and group commit is an eeective way to reduce disk I/O operations in main memory database systems. Jagadish, Silberschatz and Sudarshan's algorithm, utilizing group commit and one-pass log scanning, shows desirable performance both in normal database operations and recovery. Kumar's approach makes use of Non-Volatile RAM (NRAM) and a set of mechanisms to manage it, which allows normal transaction execution during system recovery. Levy and Silberschatz's algorithm lacks methods to check the increasing in log records, making recovery time long and unpredictable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Recovery in Main Memory Database Systems

In traditional database management systems, recovery activities, like checkpointing and restart, are performed in a quiescent state where no transactions are active. This approach impairs the performance of on-line transaction processing systems. Recovery related overhead is particularly troublesome in an environment where a large volatile memory is used. The appealing alternative is to perform...

متن کامل

Recovering from Main-Memory Lapses

Recovery activities like logging checkpointing and restart are used to restore a database to a consistent state after a system crash has occurred Recovery related overhead is likely to form a bottleneck in a main memory database since I O activities are performed for the sole purpose of ensuring data durability In this paper we present recovery algorithms which reduce recovery related overheads...

متن کامل

Checkpointing Schemes for Fast Restart in Main Memory

The potential for substantial performance improvement in a main memory database system (MMDB) is promising, since I/O activity is kept at minimum. On the other hand, due to the volatility of main memory, the issue of failure recovery becomes more complex than in traditional disk resident database systems. In this paper, we present four checkpointing schemes for the MMDB. The proposed schemes ar...

متن کامل

Effects of Update Techniques on Main Memory Database System Performance

Update technique is an important issue related to database recovery. In a main memory database environment, transaction execution can be processed without any I/O, and all I/O operations involved are for recovery purposes. The efficiency of update techniques therefore has an important impact on the performance of main memory database systems. In this paper, we compared the techniques of immedia...

متن کامل

Research on recovery strategy in embedded real-time main memory databases

In order to recover data from embedded real-time main memory databases effectively and efficiently, this paper proposes a real-time log-based recovery approach. With respect to the real-time requirement in embedded systems, we classify the consistency in real-time main memory databases into data and transaction consistencies, analyze them theoretically, design rules for correct recovery strateg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007